Likelihood and Confidence of Terrain Profiles in the Symmetric Dynamic Programming Stereo

نویسندگان

  • Georgy Gimel'farb
  • Tao Wu
چکیده

The paper considers probabilistic regularisation of partial occlusions in the intensity-based symmetric dynamic programming stereo (SDPS). The regularised SDPS relates the total similarity of corresponding pixels to a cumulative log-likelihood ratio for a profile that yields the correspondences. Transition probability models are investigated in detail in order to explicitly relate the likelihood ratios to reconstruction parameters. Possibilities of defining confidence of the reconstruction in terms of local distributions of the cumulative log-likelihood ratios along the GPV are discussed. 1 Center for Image Technology and Robotics Tamaki Campus, The University of Auckland, Auckland, New Zealand. [email protected] You are granted permission for the non-commercial reproduction, distribution, display, and performance of this technical report in any format, BUT this permission is only for a period of 45 (forty-five) days from the most recent time that you verified that this technical report is still available from the CITR Tamaki web site under terms that include this permission. All other rights are reserved by the author(s). Likelihood and Con dence of Terrain Pro les in the Symmetric Dynamic Programming Stereo Georgy Gimel'farb and Tao Wu CITR, Department of Computer Science Tamaki Campus, University of Auckland Private Bag 92019, Auckland 1 [email protected]

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Stereo Terrain Reconstruction by Dynamic Programming

This TR is a review of the symmetric dynamic programming approach to stereo terrain reconstruction. 1 CITR, Tamaki Campus, University Of Auckland, Auckland, New Zealand 1 Stereo Terrain Reconstruction by Dynamic Programming Georgy Gimel'farb Computer Science Department, The University of Auckland, New Zealand 1.

متن کامل

Probabilistic regularisation and symmetry in binocular dynamic programming stereo

Conventional binocular dynamic programming stereo is based on matching images of a given stereopair in order to obtain Bayesian or maximum likelihood estimates of hidden Markov models of epipolar terrain profiles. Because of partial occlusions and homogeneous textures, this problem is ill-posed and has to be regularised for getting a unique solution. Regularised matching involves usually heuris...

متن کامل

Estimating the Time of a Step Change in Gamma Regression Profiles Using MLE Approach

Sometimes the quality of a process or product is described by a functional relationship between a response variable and one or more explanatory variables referred to as profile. In most researches in this area the response variable is assumed to be normally distributed; however, occasionally in certain applications, the normality assumption is violated. In these cases the Generalized Linear Mod...

متن کامل

Improved Noise-driven Concurrent Stereo Matching Based on Symmetric Dynamic Programming Stereo

We describe a new version of the two-stage noisedriven concurrent stereo matching (NCSM) algorithm that uses symmetric dynamic programming stereo (SDPS) to estimate image noise and build candidate volumes for placing goal surfaces. In contrast to the initial NCSM, SDPS is first applied successively in xand y-directions in order to obtain a more stable disparity map from points that coincide in ...

متن کامل

Accuracy of the Regularised Dynamic Programming Stereo

Binocular stereo is an ill-posed problem that has to be regularised with respect to partial occlusions and homogeneous textures for obtaining a unique solution. We analyse typical errors of the dynamic programming stereo based on a probabilistic regularisation of partial occlusions. Experiments show that the reconstruction is accurate until occlusions do not prevail over the binocularly visible...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2001